Path Planning for the Rapid Reconfiguration of a Multi-Robot Formation Using an Integrated Algorithm

Path planning is crucial in the scheduling and motion of multiple robots. However, solving multi-robot path-planning problems efficiently quickly challenging due to their high complexity long computational time, especially when dealing with many This paper presents a unified mathematical model algorithm for path robots moving from one formation another an area obstacles. The problem was initially simplified by constructing cost matrix, then route achieved integrating elite enhanced multi-population genetic ant colony algorithm. performance proposed method verified through numerical simulations various scenarios. findings indicate that this exhibits efficiency yields minimal overall distance addressing reconstruction. As result, it holds promising potential